package fr.neyb.bernouilli.problem010;

import fr.neyb.bernouilli.common.math.prime.PrimeGenerator1;

public class Entry {

	public static void main(String[] args) {
		PrimeGenerator1 pg = new PrimeGenerator1();
		
		long prime=0;
		long sum=0;
		
		while((prime=pg.getNextPrime())<10){
			sum+=prime;
		}
		
		System.out.println(sum);
	}
}
